Benchmarking concept of small sized construction company
نویسندگان
چکیده
منابع مشابه
It Infrastructure for Supply Chain Management in Company Networks with Small and Medium-Sized Enterprise
The current trend of extending operations management beyond the company’s wall focuses on the integration of suppliers and consumers into a single information network. The objective is to optimize costs and opportunities for everyone involved. However, small-sized enterprises can rarely carry the high acquisition and introduction costs of hardware and software. This reduces the attractiveness o...
متن کاملElectric Load Shape Benchmarking for Small- and Medium-Sized Commercial Buildings
Smalland medium-sized commercial buildings owners and utility managers often look for opportunities for energy cost savings through energy efficiency and energy waste minimization. However, they currently lack easy access to low-cost tools that help interpret the massive amount of data needed to improve understanding of their energy use behaviors. Benchmarking is one of the techniques used in e...
متن کاملImproving Competitiveness of a Construction Company
Competitive edge is a multifaceted problem for any construction company. One of the problems is that evaluation of competitiveness has to be an important phase in selecting the subcontractor for state or municipal contract. This will both reduce risks and improve efficiency of state investment. This view on the problem of competitiveness evaluation is rather new and its solution can be made wit...
متن کاملSmall steps beyond benchmarking
This paraphrased quote from the former president of the Institute of Healthcare Improvement Donald Berwick eloquently clarifies that we need to compare ourselves in order to optimize the outcome for our patients. In our view this is only the first step in quality improvement. In many countries intensive care units (ICU) quality registries exist for benchmarking.(1,2) The first step in the impro...
متن کاملExplicit construction of linear sized tolerant networks
What is the minimum possible number of vertices and edges of a graph G, such that even after removing all but E portion of its vertices or edges, the remaining graph still contains a path of length m? This problem arises naturally in the study of fault tolerant linear arrays, (see [18]). The vertices of G represent processing elements and its edges correspond to communication links between thes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Istrazivanja i projektovanja za privredu
سال: 2013
ISSN: 1451-4117
DOI: 10.5937/jaes11-4856